Benedikt Bollig and Dietrich Kuske Distributed Muller Automata and Logics Research Report LSV - 06 - 11 May 2006
نویسندگان
چکیده
We consider Muller asynchronous cellular automata running on infinite dags over distributed alphabets. We show that they have the same expressive power as the existential fragment of a monadic secondorder logic featuring a first-order quantifier to express that there are infinitely many elements satisfying some property. Our result is based on an extension of the classical Ehrenfeucht-Fräıssé game to cope with infinite structures and the new first-order quantifier. As a byproduct, we obtain a logical characterization of unbounded Muller message-passing automata running on infinite message sequence charts.
منابع مشابه
Muller Message-Passing Automata and Logics
We study nonterminating message-passing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Büchi, and terminationdetecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, we give a logical characterization. More precisely, we show that they have the same expressive power as the...
متن کاملAn optimal construction of Hanf sentences
We give a new construction of formulas in Hanf normal form that are equivalent to first-order formulas over structures of bounded degree. This is the first algorithm whose running time is shown to be elementary. The triply exponential upper bound is complemented by a matching lower bound.
متن کاملManfred Droste 1 and Dietrich Kuske
Weighted automata are classical finite automata in which the transitions carry weights. 7 These weights may model quantitative properties like the amount of resources needed for executing 8 a transition or the probability or reliability of its successful execution. Using weighted automata, 9 we may also count the number of successful paths labeled by a given word. 10 As an introduction into thi...
متن کاملAutomata and Logics for Concurrent Systems: Five Models in Five Pages
We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.
متن کاملWeighted automata
Weighted automata are classical finite automata in which the transitions carry weights. 7 These weights may model quantitative properties like the amount of resources needed for executing 8 a transition or the probability or reliability of its successful execution. Using weighted automata, 9 we may also count the number of successful paths labeled by a given word. 10 As an introduction into thi...
متن کامل